Multiple Hypothesis Testing by Finite Memory Algorithms

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hypothesis testing with finite memory in finite time (Corresp.)

Let X1,X,,. . . be a sequence of independent observations each drawn from an observation space I and each distributed according to a probability density function p(x). There are two possible states of nature Ho and HI with a priori probabilities n0 and nl. Under Ho, p(x) = pO(x), a known density, while under HI, p(x) = PI(X), also a known density. To determine the true state of nature we formul...

متن کامل

Multiple Hypothesis Testing by Clustering Treatment Effects

Multiple hypothesis testing and clustering have been the subject of extensive research in high-dimensional inference, yet these problems usually have been treated separately. By defining true clusters in terms of shared parameter values, we could improve the sensitivity of individual tests, because more data bearing on the same parameter values are available. We develop and evaluate a hybrid me...

متن کامل

Mdl Multiple Hypothesis Testing

This paper examines the problem of simultaneously testing many independent multiple hypotheses within the minimum encoding framework. We introduce an efficient coding scheme for nominating the accepted hypotheses in addition to compressing the data given these hypotheses. This formulation reveals an interesting connection between multiple hypothesis testing and mixture modelling with the class ...

متن کامل

Pitfalls of statistical hypothesis testing: multiple testing.

The word " five " is missing from the third sentence of the fifth paragraph in the online answers to this Endgames article by Philip Sedgwick (BMJ 2014;349:g5310, doi:10.1136/bmj. g5310). The sentence should have read: " For example, the probability of a significant result when there are two, three, four, and five hypothesis tests is 0.

متن کامل

Parameter Tuning by Simple Regret Algorithms and Multiple Simultaneous Hypothesis Testing

“Simple regret” algorithms are designed for noisy optimization in unstructured domains. In particular, this literature has shown that the uniform algorithm is indeed optimal asymptotically and suboptimal nonasymptotically. We investigate theoretically and experimentally the application of these algorithms, for automatic parameter tuning, in particular from the point of view of the number of sam...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Annals of Statistics

سال: 1974

ISSN: 0090-5364

DOI: 10.1214/aos/1176342666